Constraints over Lambda Structures, Antecedent Contained Deletion, and Quantiier Identities

The constraint language for lambda-structures (CLLS) allows for a simple, integrated , and underspeciied treatment of scope, ellipses, anaphora, and their interaction. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. In the case of antecedent contained deletion (ACD), the deenition of parallelism in the original version of CLLS is slightly too restrictive due to an overly weak notion of quantiier identity. We show how to extend CLLS with an appropriate notion of quantiier identity such that ACD can be naturally analysed. This sheds some light on connicting requirements on quantiier representations as needed for ACD and Hirschb uhler sentences.